GATE CSE 1990

Q1.

Choose the correct alternatives (More than one may be correct).The number of ways in which 5 A's, 5 B's and 5 C's can be arranged in a row is:
GateOverflow

Q2.

Choose the correct alternatives (More than one may be correct).The total external path length, EPL, of a binary tree with n external nodes is, \Sigma _w=Iw, where I_{w} is the path length of external node w),
GateOverflow

Q3.

Choose the correct alternatives (More than one may be correct).The number of rooted binary trees with n nodes is,
GateOverflow

Q4.

Choose the correct alternatives (More than one may be correct).Indicate which of the following statements are true: A relational database which is in 3NF may still have undesirable data redundancy because there may exist:
GateOverflow

Q5.

Choose the correct alternatives (More than one may be correct).Recursive languages are:
GateOverflow

Q6.

Choose the correct alternatives (More than one may be correct).Let R_{1} and R_{1} be regular sets defined over the alphabet \Sigma Then:
GateOverflow

Q7.

Choose the correct alternatives (More than one may be correct).The complexity of comparision based sorting algorithms is:
GateOverflow

Q8.

Choose the correct alternatives (More than one may be correct).It is undecidable whether:
GateOverflow